Dynamic function optimisation with hybridised extremal dynamics
نویسندگان
چکیده
Dynamic function optimisation is an important research area because many real-world problems are inherently dynamic in nature. Over the years, a wide variety of algorithms have been proposed to solve dynamic optimisation problems, and many of these algorithms have used the Moving Peaks (MP) benchmark to test their own capabilities against other approaches. This paper presents a detailed account of our hybridised Extremal Optimisation (EO) approach that has achieved hitherto unsurpassed results on the three standardised scenarios of the MP problem. Several different components are used in the hybrid EO, and it has been shown that a large proportion of the quality of its outstanding performance is due to the local search component. In this paper, the behaviour of the local search algorithms used is analysed, and the roles of other components are discussed. In the concluding remarks, the generalisation ability of this method and its wider applicability are highlighted.
منابع مشابه
On the Behaviour of Extremal Optimisation When Solving Problems with Hidden Dynamics
Solving dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms. Due to its extremely simple functionality, it is likely that the...
متن کاملSolving Problems with Hidden Dynamics - Comparison of Extremal Optimisation and Ant Colony System
dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a dynamic problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms, while Ant Colony System has been used to solve a large variety o...
متن کاملA Hybrid Harmony Search Algorithm for Solving Dynamic Optimisation Problems
Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to seek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one o...
متن کاملDynamic Problems and Nature
Dynamic problems and nature inspired meta-heuristics. Originally published in Studies in computational intelligence: Biologically-inspired optimisation methods: parallel algorithms, systems and applications, Chapter 4, pp. 79-110 Summary. Biological systems have often been used as the inspiration for search techniques to solve continuous and discrete combinatorial optimisation problems. One of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Memetic Computing
دوره 2 شماره
صفحات -
تاریخ انتشار 2010